Optimizing the computation of overriding

We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the applicative examples naturally arising in biomedical domains and semantic web access control policies. Such optimizations are validated experimentally on large KBs with more than 30K axioms. Speedups exceed 1 order of magnitude. For the first time, response times compatible with real-time reasoning are obtained with nonmonotonic KBs of this size

Biotyping of Penicillium marneffei reveals concentration- dependent growth inhibition by galactose

Thirty-two isolates of the dimorphic fungus Penicillium marneffei were studied for their biochemical properties. All isolates possessed the enzyme urease and were inhibited by 500 mg of cycloheximide per liter. No strain fermented glucose, and thus no strain fermented any of the other five sugars tested. All assimilated glucose, maltose, and cellobiose; only one of the isolates did not assimilate salicin. Totals of 65.6, 84.4, and 71.9% of the isolates assimilated trehalose, xylose, and nitrate, respectively. Twelve strains possessed the enzyme β-galactosidase. Overall, 17 different biotypes were recognized, but no association was found between the human immunodeficiency virus status of the patients and the biotype. A novel finding of concentrationdependent growth inhibition of P. marneffei by galactose is described. Inhibition of growth occurred at a low concentration of galactose (0.015 to 0.25%) when galactose was the sole carbon source in the medium. Morphological changes of the fungal cells were observed in the presence of galactose.published_or_final_versio

Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security Protocols

As more resources are added to computer networks, and as more vendors look to the World Wide Web as a viable marketplace, the importance of being able to restrict access and to insure some kind of acceptable behavior even in the presence of malicious adversaries becomes paramount. Many researchers have proposed the use of security protocols to provide these security guarantees. In this paper, we develop a method of verifying these protocols using a special purpose model checker which executes an exhaustive state space search of a protocol model. Our tool also includes a natural deduction style derivation engine which models the capabilities of the adversary trying to attack the protocol. Because our models are necessarily abstractions, we cannot prove a protocol correct. However, our tool is extremely useful as a debugger. We have used our tool to analyze 14 different authentication protocols, and have found the previously reported attacks for them. Keywords Model checking, security ..